Star Of David Theorem
   HOME

TheInfoList



OR:

The Star of David theorem is a mathematical result on
arithmetic Arithmetic () is an elementary part of mathematics that consists of the study of the properties of the traditional operations on numbers— addition, subtraction, multiplication, division, exponentiation, and extraction of roots. In the 19th ...
properties of
binomial coefficients In mathematics, the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by a pair of integers and is written \tbinom. It is the coefficient of the t ...
. It was discovered by
Henry W. Gould Henry Wadsworth Gould (born August 26, 1928) is a Professor Emeritus of Mathematics at West Virginia University. Early life and education Gould was born in Portsmouth, Virginia, Portsmouth, Virginia. Between 1945 and 1947, he attended National R ...
in 1972.


Statement

The
greatest common divisor In mathematics, the greatest common divisor (GCD) of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For two integers ''x'', ''y'', the greatest common divisor of ''x'' and ''y'' is ...
s of the binomial coefficients forming each of the two triangles in the
Star of David The Star of David (). is a generally recognized symbol of both Jewish identity and Judaism. Its shape is that of a hexagram: the compound of two equilateral triangles. A derivation of the ''seal of Solomon'', which was used for decorative ...
shape in
Pascal's triangle In mathematics, Pascal's triangle is a triangular array of the binomial coefficients that arises in probability theory, combinatorics, and algebra. In much of the Western world, it is named after the French mathematician Blaise Pascal, although ot ...
are equal: : \begin & \gcd\left\ \\ pt= & \gcd\left\. \end


Examples

Rows 8, 9, and 10 of Pascal's triangle are : For ''n''=9, ''k''=3 or ''n''=9, ''k''=6, the element 84 is surrounded by, in sequence, the elements 28, 56, 126, 210, 120, 36. Taking alternating values, we have gcd(28, 126, 120) = 2 = gcd(56, 210, 36). The element 36 is surrounded by the sequence 8, 28, 84, 120, 45, 9, and taking alternating values we have gcd(8, 84, 45) = 1 = gcd(28, 120, 9).


Generalization

The above greatest common divisor also equals \gcd \left(, , , \right). Weisstein, Eric W. "Star of David Theorem." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/StarofDavidTheorem.html Thus in the above example for the element 84 (in its rightmost appearance), we also have gcd(70, 56, 28, 8) = 2. This result in turn has further generalizations.


Related results

The two sets of three numbers which the Star of David theorem says have equal greatest common divisors also have equal products. For example, again observing that the element 84 is surrounded by, in sequence, the elements 28, 56, 126, 210, 120, 36, and again taking alternating values, we have 28×126×120 = 26×33×5×72 = 56×210×36. This result can be confirmed by writing out each binomial coefficient in factorial form, using :=\frac.


See also

*
List of factorial and binomial topics {{Short description, none This is a list of factorial and binomial topics in mathematics. See also binomial (disambiguation). * Abel's binomial theorem * Alternating factorial *Antichain *Beta function *Bhargava factorial *Binomial coefficient **P ...


References

{{reflist * H. W. Gould, "A New Greatest Common Divisor Property of The Binomial Coefficients", ''
Fibonacci Quarterly The ''Fibonacci Quarterly'' is a scientific journal on mathematical topics related to the Fibonacci numbers, published four times per year. It is the primary publication of The Fibonacci Association, which has published it since 1963. Its founding ...
'' 10 (1972), 579–584.
Star of David theorem
from ''MathForum''.
Star of David theorem
blog post.


External links


Demonstration of the Star of David theorem
in ''
Mathematica Wolfram Mathematica is a software system with built-in libraries for several areas of technical computing that allow machine learning, statistics, symbolic computation, data manipulation, network analysis, time series analysis, NLP, optimizat ...
''. Theorems in discrete mathematics Combinatorics Factorial and binomial topics